Formalization of Reliability Block Diagrams in Higher-order Logic
نویسندگان
چکیده
منابع مشابه
Formalization of Reliability Block Diagrams in Higher-order Logic
Reliability Block Diagrams (RBDs) allow us to model the failure relationships of complex systems and their sub-components and are extensively used for system reliability, availability and maintainability analyses. Traditionally, these RBD-based analyses are done using paper-and-pencil proofs or computer simulations, which cannot ascertain absolute correctness due to their inherent limitations. ...
متن کاملTowards the Formalization of Fractional Calculus in Higher-Order Logic
Fractional calculus is a generalization of classical theories of integration and differentiation to arbitrary order (i.e., real or complex numbers). In the last two decades, this new mathematical modeling approach has been widely used to analyze a wide class of physical systems in various fields of science and engineering. In this paper, we describe an ongoing project which aims at formalizing ...
متن کاملFormalization of Complex Vectors in Higher-Order Logic
Complex vector analysis is widely used to analyze continuous systems in many disciplines, including physics and engineering. In this paper, we present a higher-order-logic formalization of the complex vector space to facilitate conducting this analysis within the sound core of a theorem prover: HOL Light. Our definition of complex vector builds upon the definitions of complex numbers and real v...
متن کاملFormal Reliability Analysis using Higher-Order Logic Theorem Proving
Formal Reliability Analysis using Higher-Order Logic Theorem Proving Naeem Ahmad Abbasi, Ph. D. Concordia University, 2012 Traditional techniques used in the reliability analysis of engineering systems have limitations. Paper-and-pencil based analysis is prone to human error and simulation based techniques cannot be computationally one hundred percent accurate. An alternative to these two tradi...
متن کاملHigher Order City Voronoi Diagrams
We investigate higher-order Voronoi diagrams in the city metric. This metric is induced by quickest paths in the L1 metric in the presence of an accelerating transportation network of axis-parallel line segments. For the structural complexity of k-order city Voronoi diagrams of n point sites, we show an upper bound of O(k(n − k) + kc) and a lower bound of Ω(n+ kc), where c is the complexity of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Logic
سال: 2016
ISSN: 1570-8683
DOI: 10.1016/j.jal.2016.05.007